Towards a Topology Generator Modeling AS Relationships

نویسندگان

  • Xenofontas Dimitropoulos
  • George Riley
  • Dmitri Krioukov
  • Ravi Sundaram
چکیده

The development of realistic topology generators is a problem that has attracted significant attention the last few years. There exist a number of competing approaches to construction of random graphs reproducing important properties of real networks. Unfortunately, all the existing approaches do not capture an inherent aspect of many real networks: links in real networks represent relationships, which can be of several types reflecting different properties. Such link type inhomogeneity is present in the AS topology of the Internet, which is a intermix of customerto-provider (c2p), peer-to-peer (p2p) and sibling-tosibling (s2s) relationships. It also exists in social networks (different types of social relationships), in biological networks (different types of protein interactions) and in many other real networks. Node relationships not only provide additional information on the network topology structure, but more significantly, they represent an indispensable aspect of real networks, and this aspect needs to be properly modeled for many practical applications. Consider for example the case of using synthetic AS topologies to simulate a new routing protocol. In order to realistically simulate routing in a synthetic AS topology, we need to take into account how policies affect routing decisions. However, this is not possible with existing topology generators since they solely model the network connectivity properties without incorporating any insight about the relationships between nodes. In this work we address this problem by introducing a framework for modeling different relationships found in real networks. We use our framework to model AS relationships in the Internet and to develop an AS topology generator that generates AS graphs with realistic connectivity properties as well as realistic AS relationships. 2 Modeling AS relationships

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Systematic Method to Analyze Transport Networks: Considering Traffic Shifts

Current network modeling practices usually assess the network performance at specified time interval, i.e. every 5 or 10 years time horizon. Furthermore, they are usually based on partially predictable data, which are being generated through various stochastic procedures. In this research, a new quantitative based methodology which combines combinatorial optimization modeling and transportation...

متن کامل

Cc-modeler: a Topology Generator for 3-d City Models

In this paper, we introduce a semi-automated topology generator for 3-D objects, CC-Modeler (CyberCity Modeler). Given the data as point clouds measured on Analytical Plotters or Digital Stations, we present a new method for fitting planar structures to the measured sets of point clouds. While this topology generator has been originally designed to model buildings, it can also be used for other...

متن کامل

PMU-Based Matching Pursuit Method for Black-Box Modeling of Synchronous Generator

This paper presents the application of the matching pursuit method to model synchronous generator. This method is useful for online analysis. In the proposed method, the field voltage is considered as input signal, while the terminal voltage and active power of the generator are output signals. Usually, the difference equation with a second degree polynomial structure is used to estimate the co...

متن کامل

Topology discovery by active probing

As the Internet has grown, so has the challenge of accurate measurement and modeling of its topology. Commonly used but coarse methods of measuring topology, e.g., BGP tables, suffer from several limitations. To pursue more accurate empirically-based topology modeling. CAIDA began its Macroscopic Topology Project in 1998, The project focus is actively measuring topology and round trip time (RTT...

متن کامل

On the Spectrum and Structure of Internet Topology Graphs

In this paper we study properties of the Internet topology on the autonomous system (AS) level. We find that the normalized Laplacian spectrum (nls) of a graph provides a concise fingerprint of the corresponding network topology. The nls of AS graphs remains stable over time in spite of the explosive growth of the Internet, but the nls of synthetic graphs obtained using the state-of-the-art top...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2005